Parallel Min-max Ant Colony System (mmas) for Dynamic Process Scheduling in Distributed Operating Systems Considering Load Balancing
نویسندگان
چکیده
This paper presents and evaluates a new method for process scheduling in distributed systems .Scheduling in distributed operating systems has a significant role in overall system performance and throughput. An efficient scheduling is vital for system performance .The scheduling in distributed systems is known as an NPcomplete problem, even in the best conditions, and methods based on heuristic search have been proposed to obtain optimal and suboptimal solutions. In this paper, we proposed an Ant-based algorithm to solve this problem considering dynamic load balancing efficiently. We evaluate the performance and efficiency of the proposed algorithm using simulation results.
منابع مشابه
Pre-scheduled Colony Size Variation in Dynamic Environments
The performance of the MAX -MIN ant system (MMAS) in dynamic optimization problems (DOPs) is sensitive to the colony size. In particular, a large colony size may waste computational resources whereas a small colony size may restrict the searching capabilities of the algorithm. There is a trade off in the behaviour of the algorithm between the early and later stages of the optimization process. ...
متن کاملImplementation of a Parallel Algorithm Based on a Spark Cloud Computing Platform
Parallel algorithms, such as the ant colony algorithm, take a long time when solving large-scale problems. In this paper, the MAX-MIN Ant System algorithm (MMAS) is parallelized to solve Traveling Salesman Problem (TSP) based on a Spark cloud computing platform. We combine MMAS with Spark MapReduce to execute the path building and the pheromone operation in a distributed computer cluster. To im...
متن کاملAnt Colony Optimization Approaches for Scheduling Jobs with Incompatible Families on Parallel Batch Machines
In this paper, we suggest an Ant Colony System (ACS) to solve a scheduling problem for jobs with incompatible families on parallel batch machines. We are interested in minimizing total weighted tardiness (TWT) of the jobs. Problems of this type have practical importance in semiconductor manufacturing. The ACS scheme includes an efficient local search technique based on swapping jobs across diff...
متن کاملCloud Task Scheduling for Load Balancing based on Intelligent Strategy
Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization prob...
متن کاملParallel Max-Min Ant System Using MapReduce
Ant colony optimization algorithms have been successfully applied to solve many problems. However, in some large scale optimization problems involving large amounts of data, the optimization process may take hours or even days to get an excellent solution. Developing parallel optimization algorithms is a common way to tackle with this issue. In this paper, we present a MapReduce Max-Min Ant Sys...
متن کامل